Distribution modulo 1 and sets of uniqueness
نویسندگان
چکیده
منابع مشابه
Distribution of Powers modulo 1 and Relatedtopicsmiguel
This is a review of several results related to distribution of powers and combinations of powers modulo 1. We include a proof that given any sequence of real numbers n , it is possible to get an (given 6 = 0), or a (given > 1) such that n is close to n modulo 1. We also prove that in a number eld, if a combination of powers 1 n 1 + + m n m has bounded v-adic absolute value (where v is any non-A...
متن کاملSets of extended uniqueness and σ - porosity
We show that there exists a closed non-σ-porous set of extended uniqueness. We also give a new proof of Lyons’ theorem, which shows that the class of H(n)-sets is not large in U0.
متن کاملDistribution of Residues Modulo p
The distribution of quadratic residues and non-residues modulo p has been of intrigue to the number theorists of the last several decades. Although Gauss’ celebrated Quadratic Reciprocity Law gives a beautiful criterion to decide whether a given number is a quadratic residue modulo p or not, it is still an open problem to find a small upper bound on the least quadratic non-residue mod p as a fu...
متن کاملComputing GCDs of polynomials modulo triangular sets
We present a modular algorithm for computing GCDs of univariate polynomials with coefficients modulo a zero-dimensional triangular set. Our algorithm generalizes previous work for computing GCDs over algebraic number fields. The main difficulty is when a zero divisor is encountered modulo a prime number. We give two ways of handling this: Hensel lifting, and fault tolerant rational reconstructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1964
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1964-11108-3